From Dynamic Programming to Bynamic Programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Dynamic Programming to Greedy Algorithms

A calculus of relations is used to reason about speciications and algorithms for optimi-sation problems. It is shown how certain greedy algorithms can be seen as reenements of dynamic programming. Throughout, the maximum lateness problem is used as a motivating example.

متن کامل

Modern Computational Applications of Dynamic Programming

Computational dynamic programming, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.

متن کامل

An Introduction to Dynamic Programming

DYNAMIC programming, a mathematical field that has grown up in the past few years, is recognized in the U.S.A. as an important new research tool. However, in other countries, little interest has as yet been taken in the subject, nor has much research been performed. The objective of this paper is to give an expository introduction to the field, and give an indication of the variety of actual an...

متن کامل

Coarse-to-Fine Dynamic Programming

We introduce an extension of dynamic programming DP we call Coarse to Fine Dynamic Programming CFDP ideally suited to DP problems with large state space CFDP uses dynamic programming to solve a sequence of coarse approximations which are lower bounds to the original DP problem These approximations are developed by merging states in the original graph into superstates in a coarser graph which us...

متن کامل

The Linear Programming Approach to Approximate Dynamic Programming

The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach “fits” a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We dev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1993

ISSN: 0022-247X

DOI: 10.1006/jmaa.1993.1243